Random walk on random walks
نویسندگان
چکیده
In this paper we study a random walk in a one-dimensional dynamic random environment consisting of a collection of independent particles performing simple symmetric random walks in a Poisson equilibrium with density ρ ∈ (0,∞). At each step the random walk performs a nearest-neighbour jump, moving to the right with probability p◦ when it is on a vacant site and probability p• when it is on an occupied site. Assuming that p◦ ∈ (0, 1) and p• 6= 1 2 , we show that the position of the random walk satisfies a strong law of large numbers, a functional central limit theorem and a large deviation bound, provided ρ is large enough. The proof is based on the construction of a renewal structure together with a multiscale renormalisation argument. MSC 2010. Primary 60F15, 60K35, 60K37; Secondary 82B41, 82C22, 82C44.
منابع مشابه
A PRELUDE TO THE THEORY OF RANDOM WALKS IN RANDOM ENVIRONMENTS
A random walk on a lattice is one of the most fundamental models in probability theory. When the random walk is inhomogenous and its inhomogeniety comes from an ergodic stationary process, the walk is called a random walk in a random environment (RWRE). The basic questions such as the law of large numbers (LLN), the central limit theorem (CLT), and the large deviation principle (LDP) are ...
متن کاملOn the speed of Random Walks among Random Conductances
We consider random walk among random conductances where the conductance environment is shift invariant and ergodic. We study which moment conditions of the conductances guarantee speed zero of the random walk. We show that if there exists α > 1 such that E[log ωe] < ∞, then the random walk has speed zero. On the other hand, for each α < 1 we provide examples of random walks with non-zero speed ...
متن کاملFaster Clustering via Non-Backtracking Random Walks
This paper presents VEC-NBT, a variation on the unsupervised graph clustering technique VEC, which improves upon the performance of the original algorithm significantly for sparse graphs. VEC employs a novel application of the state-ofthe-art word2vec model to embed a graph in Euclidean space via random walks on the nodes of the graph. In VEC-NBT, we modify the original algorithm to use a non-b...
متن کاملMaximum Consistency Preferential Random Walks
Random walk plays a significant role in computer science. The popular PageRank algorithm uses random walk. Personalized random walks force random walk to “personalized views” of the graph according to users’ preferences. In this paper, we show the close relations between different preferential random walks and label propagation methods used in semi-supervised learning. We further present a maxi...
متن کاملRandom Walks in Cones
We study the asymptotic behaviour of a multidimensional random walk in a general cone. We find the tail asymptotics for the exit time and prove integral and local limit theorems for a random walk conditioned to stay in a cone. The main step in the proof consists in constructing a positive harmonic function for our random walk under minimal moment restrictions on the increments. For the proof of...
متن کاملDynamic Quantum Bernoulli Random Walks
Quantum Bernoulli random walks can be realized as random walks on the dual of SU(2). We use this realization in order to study a model of dynamic quantum Bernoulli random walk with time dependent transitions. For the corresponding dynamic random walk on the dual of SU(2), we prove several limit theorems (local limit theorem, central limit theorem, law of large numbers, large deviations principl...
متن کامل